TSTP Solution File: SET201^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET201^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:04:45 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 36 ( 7 unt; 7 typ; 0 def)
% Number of atoms : 235 ( 82 equ; 0 cnn)
% Maximal formula atoms : 16 ( 8 avg)
% Number of connectives : 235 ( 41 ~; 30 |; 40 &; 104 @)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 56 ( 0 ^ 38 !; 18 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
cV: a > $o ).
thf(func_def_5,type,
sK0: a > $o ).
thf(func_def_6,type,
sK1: a > $o ).
thf(func_def_7,type,
sK2: a > $o ).
thf(func_def_8,type,
sK3: a ).
thf(f34,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f29,f33]) ).
thf(f33,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f32]) ).
thf(f32,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f31,f24]) ).
thf(f24,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| spl4_2 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f22,plain,
( spl4_2
<=> ( $true
= ( sK1 @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
thf(f31,plain,
( $true
= ( sK1 @ sK3 ) ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
( ( $true != $true )
| ( $true
= ( sK1 @ sK3 ) ) ),
inference(superposition,[],[f13,f14]) ).
thf(f14,plain,
( $true
= ( sK2 @ sK3 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( $true
= ( sK0 @ sK3 ) )
& ( ( $true
!= ( cV @ sK3 ) )
| ( $true
!= ( sK1 @ sK3 ) ) )
& ( $true
= ( sK2 @ sK3 ) )
& ! [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
| ( $true
= ( sK1 @ X4 ) ) )
& ! [X5: a] :
( ( $true
!= ( sK0 @ X5 ) )
| ( $true
= ( cV @ X5 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( ( cV @ X3 )
!= $true )
| ( ( X1 @ X3 )
!= $true ) )
& ( ( X2 @ X3 )
= $true ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( $true
= ( X1 @ X4 ) ) )
& ! [X5: a] :
( ( $true
!= ( X0 @ X5 ) )
| ( $true
= ( cV @ X5 ) ) ) )
=> ( ? [X3: a] :
( ( $true
= ( sK0 @ X3 ) )
& ( ( ( cV @ X3 )
!= $true )
| ( $true
!= ( sK1 @ X3 ) ) )
& ( $true
= ( sK2 @ X3 ) ) )
& ! [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
| ( $true
= ( sK1 @ X4 ) ) )
& ! [X5: a] :
( ( $true
!= ( sK0 @ X5 ) )
| ( $true
= ( cV @ X5 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: a] :
( ( $true
= ( sK0 @ X3 ) )
& ( ( ( cV @ X3 )
!= $true )
| ( $true
!= ( sK1 @ X3 ) ) )
& ( $true
= ( sK2 @ X3 ) ) )
=> ( ( $true
= ( sK0 @ sK3 ) )
& ( ( $true
!= ( cV @ sK3 ) )
| ( $true
!= ( sK1 @ sK3 ) ) )
& ( $true
= ( sK2 @ sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X3: a] :
( ( ( X0 @ X3 )
= $true )
& ( ( ( cV @ X3 )
!= $true )
| ( ( X1 @ X3 )
!= $true ) )
& ( ( X2 @ X3 )
= $true ) )
& ! [X4: a] :
( ( ( X2 @ X4 )
!= $true )
| ( $true
= ( X1 @ X4 ) ) )
& ! [X5: a] :
( ( $true
!= ( X0 @ X5 ) )
| ( $true
= ( cV @ X5 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o,X2: a > $o] :
( ? [X5: a] :
( ( $true
= ( X0 @ X5 ) )
& ( ( $true
!= ( cV @ X5 ) )
| ( $true
!= ( X1 @ X5 ) ) )
& ( $true
= ( X2 @ X5 ) ) )
& ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
| ( $true
= ( cV @ X4 ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X1: a > $o,X2: a > $o,X0: a > $o] :
( ? [X5: a] :
( ( ( $true
!= ( cV @ X5 ) )
| ( $true
!= ( X1 @ X5 ) ) )
& ( $true
= ( X2 @ X5 ) )
& ( $true
= ( X0 @ X5 ) ) )
& ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
!= ( X0 @ X4 ) )
| ( $true
= ( cV @ X4 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X1: a > $o,X2: a > $o,X0: a > $o] :
( ( ! [X3: a] :
( ( ( X2 @ X3 )
= $true )
=> ( ( X1 @ X3 )
= $true ) )
& ! [X4: a] :
( ( $true
= ( X0 @ X4 ) )
=> ( $true
= ( cV @ X4 ) ) ) )
=> ! [X5: a] :
( ( ( $true
= ( X2 @ X5 ) )
& ( $true
= ( X0 @ X5 ) ) )
=> ( ( $true
= ( cV @ X5 ) )
& ( $true
= ( X1 @ X5 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o,X2: a > $o] :
( ( ! [X3: a] :
( ( X2 @ X3 )
=> ( X1 @ X3 ) )
& ! [X4: a] :
( ( X0 @ X4 )
=> ( cV @ X4 ) ) )
=> ! [X5: a] :
( ( ( X2 @ X5 )
& ( X0 @ X5 ) )
=> ( ( cV @ X5 )
& ( X1 @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( cV @ X3 ) ) )
=> ! [X3: a] :
( ( ( X0 @ X3 )
& ( X2 @ X3 ) )
=> ( ( cV @ X3 )
& ( X1 @ X3 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X2: a > $o,X1: a > $o,X0: a > $o] :
( ( ! [X3: a] :
( ( X0 @ X3 )
=> ( X1 @ X3 ) )
& ! [X3: a] :
( ( X2 @ X3 )
=> ( cV @ X3 ) ) )
=> ! [X3: a] :
( ( ( X0 @ X3 )
& ( X2 @ X3 ) )
=> ( ( cV @ X3 )
& ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QkIYqOI36q/Vampire---4.8_8651',cBOOL_PROP_41_pme) ).
thf(f13,plain,
! [X4: a] :
( ( $true
!= ( sK2 @ X4 ) )
| ( $true
= ( sK1 @ X4 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f29,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f28]) ).
thf(f28,plain,
( $false
| spl4_1 ),
inference(subsumption_resolution,[],[f27,f20]) ).
thf(f20,plain,
( ( $true
!= ( cV @ sK3 ) )
| spl4_1 ),
inference(avatar_component_clause,[],[f18]) ).
thf(f18,plain,
( spl4_1
<=> ( $true
= ( cV @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
thf(f27,plain,
( $true
= ( cV @ sK3 ) ),
inference(trivial_inequality_removal,[],[f26]) ).
thf(f26,plain,
( ( $true != $true )
| ( $true
= ( cV @ sK3 ) ) ),
inference(superposition,[],[f12,f16]) ).
thf(f16,plain,
( $true
= ( sK0 @ sK3 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f12,plain,
! [X5: a] :
( ( $true
!= ( sK0 @ X5 ) )
| ( $true
= ( cV @ X5 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f25,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f15,f22,f18]) ).
thf(f15,plain,
( ( $true
!= ( sK1 @ sK3 ) )
| ( $true
!= ( cV @ sK3 ) ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET201^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 16:22:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.QkIYqOI36q/Vampire---4.8_8651
% 0.13/0.37 % (8768)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.13/0.37 % (8767)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.13/0.37 % (8768)First to succeed.
% 0.13/0.37 % (8763)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.13/0.37 % (8765)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.13/0.37 % (8767)Also succeeded, but the first one will report.
% 0.13/0.37 % (8765)Instruction limit reached!
% 0.13/0.37 % (8765)------------------------------
% 0.13/0.37 % (8765)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (8765)Termination reason: Unknown
% 0.13/0.37 % (8765)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (8765)Memory used [KB]: 895
% 0.13/0.37 % (8765)Time elapsed: 0.002 s
% 0.13/0.37 % (8765)Instructions burned: 2 (million)
% 0.13/0.37 % (8765)------------------------------
% 0.13/0.37 % (8765)------------------------------
% 0.13/0.37 % (8768)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for Vampire---4
% 0.13/0.37 % SZS output start Proof for Vampire---4
% See solution above
% 0.13/0.37 % (8768)------------------------------
% 0.13/0.37 % (8768)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (8768)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (8768)Memory used [KB]: 5500
% 0.13/0.37 % (8768)Time elapsed: 0.004 s
% 0.13/0.37 % (8768)Instructions burned: 2 (million)
% 0.13/0.37 % (8768)------------------------------
% 0.13/0.37 % (8768)------------------------------
% 0.13/0.37 % (8760)Success in time 0.015 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------